A solution approach to minimum spanning tree problem under fermatean fuzzy environment

In classical graph theory, the minimal spanning tree (MST) is a subgraph with no cycles that connects each vertex minimum edge weights. Calculating of has always been common problem throughout ages. Fuzzy (FMST) able to handle uncertainty existing in weights for fuzzy which occurs real world situations. this article, we have studied MST directed and undirected whose are represented by fermatean numbers (FFN). We focus on determining an algorithmic approach solving (FFMST) using modified Prim’s algorithm optimum branching under FFN environment. Since proposed includes ranking arithmetic operations, use FFNs improved scoring function compare edges graph. With help numerical examples, solution technique FFMST model described.